On diameter and inverse degree of a graph
نویسنده
چکیده
The inverse degree r(G) of a finite graph G = (V, E) is defined as r(G) = v∈V 1 deg v , where deg v is the degree of vertex v. We establish inequalities concerning the sum of the diameter and the inverse degree of a graph which for the most part are tight. We also find upper bounds on the diameter of a graph in terms of its inverse degree for several important classes of graphs.
منابع مشابه
Diameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملOn diameter and inverse degree of chemical graphs
The inverse degree r(G) of a finite graph G = (V,E) is defined as r(G) = ∑ v∈V 1 d(v) , where d(v) is the degree of vertex v. In Discrete Math. 310 (2010), 940-946, Mukwembi posed the following conjecture: Let G be a connected chemical graph with diameter diam(G) and inverse degree r(G). Then diam(G) ≤ 12 5 r(G) +O(1). In this paper, we settle the conjecture affirmatively.
متن کاملOn Harmonic Index and Diameter of Unicyclic Graphs
The Harmonic index $ H(G) $ of a graph $ G $ is defined as the sum of the weights $ dfrac{2}{d(u)+d(v)} $ of all edges $ uv $ of $G$, where $d(u)$ denotes the degree of the vertex $u$ in $G$. In this work, we prove the conjecture $dfrac{H(G)}{D(G)} geq dfrac{1}{2}+dfrac{1}{3(n-1)} $ given by Jianxi Liu in 2013 when G is a unicyclic graph and give a better bound $ dfrac{H(G)}{D(G)}geq dfra...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010